Pull Request Overview

This PR adds a new Minimum Window Substring algorithm implementation in R using a sliding window approach with two pointers. The algorithm finds the smallest substring in a main string that contains all characters from a target string.

Key changes:

• Implements efficient sliding window algorithm with O(n) time complexity
• Provides interactive input handling with case-insensitive processing
• Includes comprehensive edge case handling and clear output formatting

_{Tip: Customize your code reviews with copilot-instructions.md. Create the file or learn how to get started.}